#include <iostream>
#include <math.h>

using namespace std;

bool prime(int k)
{
	for (int d = 2; d <= sqrt(k); d++)
		if (k % d == 0) return false;

	return true;
}

int main()
{
	while (true)
	{
		int n;
		cin >> n;
		if (n == 0) break;
		for (int p = 2; p <= n/2; p++)
			if (prime(p) && prime(n-p))
			{
				cout << n << " = " << p << " + " << n-p << endl;
				break;
			}
	}
	
	return 0;
}

